On the complexity of local search in unconstrained quadratic binary optimization

摘要

We consider the problem of finding a local minimum of a binary quadraticfunction, and show by an elementary construction that every descending localsearch algorithm takes exponential time in the worst case.